A UNIQUE SORTING ALGORITHM WITH LINEAR TIME & SPACE COMPLEXITY
نویسندگان
چکیده
منابع مشابه
Time and Space Complexity Reduction of a Cryptanalysis Algorithm
Binary Decision Diagram (in short BDD) is an efficient data structure which has been used widely in computer science and engineering. BDD-based attack in key stream cryptanalysis is one of the best forms of attack in its category. In this paper, we propose a new key stream attack which is based on ZDD(Zero-suppressed BDD). We show how a ZDD-based key stream attack is more efficient in time and ...
متن کاملTime and Space Complexity Reduction of a Cryptanalysis Algorithm
Binary Decision Diagram (in short BDD) is an efficient data structure which has been used widely in computer science and engineering. BDD-based attack in key stream cryptanalysis is one of the best forms of attack in its category. In this paper, we propose a new key stream attack which is based on ZDD(Zero-suppressed BDD). We show how a ZDD-based key stream attack is more efficient in time and ...
متن کاملMerge Sort: Awards sorting algorithm with approximate linear time complexity
Bingheng Wang Dept. of Computer Science Florida Institute of Technology Melbourne FL 32904 [email protected] ABSTRACT Given a list of elements, we rearrange the list with ascending or descending order. So far the existing approaches involve Bubble Sort, Insertion Sort, Selection Sort ( respectively in worst case) performing slow. Now we introduce a new algorithm Merge Sort to solve the problem ...
متن کاملtime and space complexity reduction of a cryptanalysis algorithm
binary decision diagram (in short bdd) is an efficient data structure which has been used widely in computer science and engineering. bdd-based attack in key stream cryptanalysis is one of the best forms of attack in its category. in this paper, we propose a new key stream attack which is based on zdd(zero-suppressed bdd). we show how a zdd-based key stream attack is more efficient in time and ...
متن کاملOn the Time-Space Tradeoff for Sorting with Linear Queries
Extending a result of Borodin, et. al. [l], we show that any branching program using linear queries " rhixi: c " to sort n numibers i ⌧pp l **,⌧n must satisfy the time-space tradeoff relation TS = n(n*) , The same relation is also shown to be true for branching programs that uses queries " min R = ? " where R is any subset of {xl,x2,...,xnj .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Research in Engineering and Technology
سال: 2014
ISSN: 2321-7308,2319-1163
DOI: 10.15623/ijret.2014.0311043